A Hybrid Methodology Approach for Container Loading Problem Using Genetic Algorithm to Maximize the Weight Distribution of Cargo
نویسندگان
چکیده
However, the efficient use of containerization involves new and specialized logistic process, a number of technologies, logistics plans and automated systems to handle a great number of containers. To answer these requirements, computation appears as important tool. For example, software can “determine the order in which the containers are to be discharged, to sped the process without destabilizing the ship" (Levinson, 2008).
منابع مشابه
Heuristics Backtracking and a Typical Genetic Algorithm for the Container Loading Problem with Weight Distribution
In this study we propose a backtracking heuristic for the solution of the Container Loading Problem with Weight Distribution. The problem consists of maximizing the loaded cargo in a single container without overlapping. Our methodology consists of the application of a backtracking heuristic in order to construct blocks of items with the intent of maximizing the total volume of the packed boxes...
متن کاملA hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system
The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to...
متن کاملCombining Heuristics Backtracking and Genetic Algorithm to Solve the Container Loading Problem with Weight Distribution
We approach the container loading problem with maximization of the weight distribution. Our methodology consists of two phases. In the first phase, it applies heuristics based on integer linear programming to construct blocks building of small items. A backtracking algorithm chooses the best heuristics. The objective of this phase is to maximize the total volume of the packed boxes. In the seco...
متن کاملEvolutionary Approach for Optimizing 3D Heterogeneous Bin Packing Problems
This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کامل